New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
نویسندگان
چکیده
The linear reachability problem is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using results on minimal solutions (in nonnegative integers) for linear Diophantine systems, we obtain new complexity results for the problem, as well as for other linear counting problems of finite state transition systems and timed automata. In contrast to previously known results, the complexity bounds obtained in this paper are polynomial in the size of the transition system in consideration, when the linear constraint is fixed.
منابع مشابه
Subtractive Reductions and Complete Problems for Counting Complexity Classes
We introduce and investigate a new type of reductions between counting problems, which we call subtractive reductions. We show that the main counting complexity classes #P, #NP, as well as all higher counting complexity classes # · kP, k 2, are closed under subtractive reductions. We then pursue problems that are complete for these classes via subtractive reductions. We focus on the class #NP (...
متن کاملLinear reachability problems and minimal solutions to linear Diophantine equation systems
The linear reachability problem for finite state transition systems is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using some known results on minimal solutions (in nonnegative integers) for linear Diophantine equation systems, we present new time complexity bounds for the pr...
متن کاملSolutions for some non-linear fractional differential equations with boundary value problems
In recent years, X.J.Xu [1] has been proved some results on mixed monotone operators. Following the paper of X.J.Xu, we study the existence and uniqueness of the positive solutions for non-linear differential equations with boundary value problems.
متن کاملSolving Linear Diophantine Constraints Incrementally
In this paper, we show how to handle linear Diophantine constraints incre-mentally by using several variations of the algorithm by Contejean and Devie (hereafter called ABCD) for solving linear Diophantine systems 4, 5]. The basic algorithm is based on a certain enumeration of the potential solutions of a system, and termination is ensured by an adequate restriction on the search. This algorith...
متن کاملAn Algorithm for Solving Systems of Linear Diophantine Equations in Naturals
A new algorithm for finding the minimal solutions of systems of linear Diophantine equations has recently been published. In its description the emphasis was put on the mathematical aspects of the algorithm. In complement to that, in this paper another presentation of the algorithm is given which may be of use for anyone wanting to implement it.
متن کامل